舰载火箭炮子母弹射击火力分配模型

摘 要：由于舰载火箭弹的弹道特性与普通身管炮弹有着明显的差异,传统的舰炮射击效力计算及火力分配方法不适用于舰载火箭炮。结合舰载火箭弹弹道特点,分析了其射击误差,探讨了集群目标的简化处理方法,提出了一种基于蒙特卡洛法的舰载火箭炮对岸射击最优效力射火力分配计算模型。通过举例分析表明,该方法切实可行,利用该模型可以提高射击指挥员指挥决策的科学性。     

面向多最优解组合优化问题的决策求解算法

针对具有固定物品总和、多最优解特征的组合优化问题,以固定总和实数子集问题和购买鸡翅问题为例,给出了这类多最优解组合优化问题的形式化表示。在分析枚举等经典算法基础上,提出了基于整数状态表示和实数状态表示的0-1决策递归搜索多最优解动态规划算法。针对该算法在最优解数量较大时,时间复杂度趋向O(mⁿ)的问题,提出了基于相同决策路径合并和基于0-x决策的两种改进算法。实验中两种改进算法的计算时间基本符合与O(nb+nm)的正比关系,表明对于这类多最优解组合优化问题具有良好的求解性能。     

Rendez‐vous search on a rectangular lattice

In a rendez‐vous search two or more teams called seekers try to minimize the time needed to find each other. In this paper, we consider s seekers in a rectangular lattice of locations where each knows the configuration of the lattice, the distribution of the seekers at time 0, and its own location, but not the location of any other. We measure time discretely, in turns. A meeting takes place when the two seekers reach the same point or adjacent points. The main result is that for any dimension of lattice, any initial distribution of seekers there are optimal strategies for the seekers that converge (in a way we shall make clear) to a center. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

解析法计算机载布撒器对单条跑道的最佳封锁策略

机载布撒器是一种先进的面覆盖式武器系统,其带状毁伤区域能有效地破坏和封锁敌方机场跑道.根据采用下抛方案的机载布撒器攻击机场跑道的工作原理,以3a为必然事件的原则,用解析的方法计算布撒器对单条机场跑道的最佳封锁策略,包括布撒器对跑道的攻击角度、所需投放的布撒器数目以及各瞄准点坐标的确定,给出了具体的算例.这种方法计算速度快,精度高,对布撒器的总体设计、作战效能分析和作战指挥都具有重要的参考价值.     

战斗机“滚筒”机动的末端规避效果

针对在线实时计算末端规避策略飞行员操纵难度大、规避效果差的现状,研究了战斗机HGB机动的末端规避效果。首先分析了HGB机动末端规避的原理;其次建立了HGB机动末端规避的数学模型;最后基于典型作战场景,研究了比例导引系数、导弹最大可用过载、制导回路延迟时间和弹目接近速度对HGB机动效果的影响,仿真得到导弹的脱靶量随HGB的机动角速度均呈先增大后减小的趋势。研究结果为飞行员选择合适的角速度范围做HGB机动末端规避时具有参考价值。     

改进的混合蛙跳算法在雷达网部署中的应用

针对雷达组网优化部署的原则,建立了区域雷达组网优化部署的数学模型,提出了一种基于改进的蛙跳算法的雷达组网优化部署方法。在阐述了改进方法的基础上,与先前方法进行了对比分析。最后,通过计算机仿真试验进行了验证,结果表明:改进的混合蛙跳算法能够快速得到多种优化部署方案,且操作性强,能较好地应用于雷达组网优化。     

基于最优制导模板的神经网络预测制导方法

针对传统预测制导方法中高精度制导与快速实时解算之间的矛盾,提出了一种基于最优制导模板的神经网络预测制导方法。该方法采用基于高置信度飞行器运动模型仿真计算预测弹道落点,利用优化理论进行迭代解算制导变量,以此为基础离线生成样本数据;通过选择合适的多结构模态神经网络,进行基于调度管理的神经网络训练,完成神经网络控制器的设计。针对CAV进行了算例设计,结果表明:该制导方法在线计算量少,制导解算速度快,制导精度高,综合性能远优于传统的预测制导方法。     

有源干扰条件下基于NSGA-Ⅱ的雷达网优化部署方法

在有源干扰条件下,雷达网部署直接影响着防区内指挥信息系统的预警监测能力。由于防区内由分散于不同位置,且重要度不同的责任区组成的,那么实现全方位全纵深的预警能力,将是雷达网部署的重要方面。根据覆盖系数和重叠系数为主要优化目标,基于NSGA-Ⅱ算法进行多目标优化。首先定义了覆盖系数和全局重叠系数两个指标,尤其是全局重叠系数打破了以往重叠系数的概念,从全局出发引导雷达网优化部署;同时,提出基于NSGA-Ⅱ的多目标优化部署算法,采用诱导跳跃、基因到位、诱导交叉等候选解生成方式,保持种群多样性,提高算法收敛性。实验表明,部署优化算法耗时较低,不同干扰源部署态势使网络节点部署产生较大差异,多样的候选解生成方法明显提高了算法的收敛速度。     

A branch and bound algorithm for computing optimal replacement policies in consecutive k‐out‐of‐n‐systems

This paper presents a branch and bound algorithm for computing optimal replacement policies in a discrete‐time, infinite‐horizon, dynamic programming model of a binary coherent system with n statistically independent components, and then specializes the algorithm to consecutive k‐out‐of‐n systems. The objective is to minimize the long‐run expected average undiscounted cost per period. (Costs arise when the system fails and when failed components are replaced.) An earlier paper established the optimality of following a critical component policy (CCP), i.e., a policy specified by a critical component set and the rule: Replace a component if and only if it is failed and in the critical component set. Computing an optimal CCP is a optimization problem with n binary variables and a nonlinear objective function. Our branch and bound algorithm for solving this problem has memory storage requirement O(n) for consecutive k‐out‐of‐n systems. Extensive computational experiments on such systems involving over 350,000 test problems with n ranging from 10 to 150 find this algorithm to be effective when n ≤ 40 or k is near n. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 288–302, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10017     

A sequential dynamic pricing model and its applications

Consider a sequential dynamic pricing model where a seller sells a given stock to a random number of customers. Arriving one at a time, each customer will purchase one item if the product price is lower than her personal reservation price. The seller's objective is to post a potentially different price for each customer in order to maximize the expected total revenue. We formulate the seller's problem as a stochastic dynamic programming model, and develop an algorithm to compute the optimal policy. We then apply the results from this sequential dynamic pricing model to the case where customers arrive according to a continuous‐time point process. In particular, we derive tight bounds for the optimal expected revenue, and develop an asymptotically optimal heuristic policy. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004.